New Weak Error Bounds and Expansions for Optimal Quantization
نویسندگان
چکیده
منابع مشابه
Frame Paths and Error Bounds for Sigma-delta Quantization
We study the performance of finite frames for the encoding of vectors by applying first-order sigma-delta quantization to the frame coefficients. Our discussion is restricted to families of uniform tight frames, given by N vectors in d-dimensional Hilbert spaces, and mostly concerns the use of quantizers that assume only integer multiples of a step-size δ (mid-tread). We prove upper and lower b...
متن کاملParabolic Cylinder Functions:Examples of Error Bounds For Asymptotic Expansions
Several asymptotic expansions of parabolic cylinder functions are discussed and error bounds for remainders in the expansions are presented. In particular Poincaré-type expansions for large values of the argument z and uniform expansions for large values of the parameter are considered. The expansions are based on those given in [5] and on modifications of these expansions given in [9]. Compute...
متن کاملWeak CSR expansions and transience bounds in max-plus algebra
This paper aims to unify and extend existing techniques for deriving upper bounds on the transient of max-plus matrix powers. To this aim, we introduce the concept of weak CSR expansions: A = CSR⊕B. We observe that most of the known bounds (implicitly) take the maximum of (i) a bound for the weak CSR expansion to hold, which does not depend on the values of the entries of the matrix but only on...
متن کاملNew Error Bounds for Solomonoff Prediction
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when it knows the true probability distribution of the sequence. Several new relations between universal Solomonoff sequence prediction and informed prediction and general probabilistic prediction schemes will be proved. Amo...
متن کاملQuantization of Overcomplete Expansions
The use of overcomplete sets of vectors (redundant bases or frames) together with quantization is explored as an alternative to transform coding for signal compression. The goal is to retain the computational simplicity of transform coding while adding exibility like adaptation to signal statistics. We show results using both xed quantization in frames and greedy quantization using matching pur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2020
ISSN: 1556-5068
DOI: 10.2139/ssrn.3699406